公正的学习排名（ULTR）旨在从有偏见的用户点击日志中训练公正的排名模型。当前的大多数超级方法基于检查假设（EH），该假设假设可以将点击概率分解为两个标量函数，一种与排名特征有关，另一个与偏见因素有关。不幸的是，在实践中，特征，偏见因素和点击之间的相互作用很复杂，通常不能以这种独立的方式分解。使用EH拟合点击数据可能会导致模型错误指定并带来近似错误。在本文中，我们提出了一个基于向量的EH，并将点击概率作为两个向量函数的点产物提出。该解决方案由于其在拟合任意点击功能方面的普遍性而完成。基于它，我们提出了一个名为Vectorization的新型模型，以通过将嵌入在基础向量上投射到基础向量上，以适应性地学习相关性嵌入和排序文档。广泛的实验表明，我们的方法在复杂的真实点击以及简单的模拟点击上大大优于最新的超级方法。

放射学报告在向医生宣传医学发现方面发挥着关键作用。在每次报告中，印象部分总结了基本放射学结果。在临床实践中，写入印象是非常需要的，耗时且易于放射科学家的错误。因此，自动印象生成被出现为有吸引力的研究方向，以促进这种临床实践。现有研究主要集中在将突出词信息引入普通文本摘要框架，以指导放射学发现中的关键内容的选择。但是，对于此任务，模型不仅需要捕获调查结果中的重要词语，而且还可以准确地描述它们的关系，以便产生高质量的印象。在本文中，我们提出了一种用于自动印象生成的新方法，其中单词图是从调查结果创建临界词汇的研究，然后设计了一个单词图引导摘要模型（WGSUM），旨在通过帮助生成印象字形图。两个数据集，OpenI和MIMIC-CXR的实验结果证实了我们所提出的方法的有效性和有效性，在两个数据集上实现了最先进的结果。还进行了进一步的实验，以分析不同图表设计对我们方法性能的影响。

灵感来自深度学习的广泛成功，已经提出了图表神经网络（GNNS）来学习表达节点表示，并在各种图形学习任务中表现出有希望的性能。然而，现有的努力主要集中在提供相对丰富的金色标记节点的传统半监督设置。虽然数据标签是难以忍受的事实令人生畏的事实并且需要强化领域知识，但特别是在考虑图形结构数据的异质性时，它通常是不切实际的。在几次半监督的环境下，大多数现有GNN的性能不可避免地受到过度装备和过天际问题的破坏，在很大程度上由于标记数据的短缺。在本文中，我们提出了一种配备有新型元学习算法的解耦的网络架构来解决这个问题。从本质上讲，我们的框架META-PN通过META学习的标签传播策略在未标记节点上乘坐高质量的伪标签，这有效增强了稀缺标记的数据，同时在培训期间启用大型接受领域。广泛的实验表明，与各种基准数据集上的现有技术相比，我们的方法提供了简单且实质性的性能。

图形广泛用于建模数据的关系结构，并且图形机器学习（ML）的研究具有广泛的应用，从分子图中的药物设计到社交网络中的友谊建议。图形ML的流行方法通常需要大量的标记实例来实现令人满意的结果，这在现实世界中通常是不可行的，因为在图形上标记了新出现的概念的数据（例如，在图形上的新分类）是有限的。尽管已将元学习应用于不同的几个图形学习问题，但大多数现有的努力主要假设所有所见类别的数据都是金标记的，而当这些方法弱标记时，这些方法可能会失去疗效严重的标签噪声。因此，我们旨在研究一个新的问题，即弱监督图元学习，以改善知识转移的模型鲁棒性。为了实现这一目标，我们提出了一个新的图形学习框架 - 本文中的图形幻觉网络（Meta-GHN）。基于一种新的鲁棒性增强的情节训练，元研究将从弱标记的数据中幻觉清洁节点表示，并提取高度可转移的元知识，这使该模型能够快速适应不见了的任务，几乎没有标记的实例。广泛的实验表明，元基因与现有图形学习研究的优越性有关弱监督的少数弹性分类的任务。

In this paper, we propose a robust 3D detector, named Cross Modal Transformer (CMT), for end-to-end 3D multi-modal detection. Without explicit view transformation, CMT takes the image and point clouds tokens as inputs and directly outputs accurate 3D bounding boxes. The spatial alignment of multi-modal tokens is performed implicitly, by encoding the 3D points into multi-modal features. The core design of CMT is quite simple while its performance is impressive. CMT obtains 73.0% NDS on nuScenes benchmark. Moreover, CMT has a strong robustness even if the LiDAR is missing. Code will be released at https://github.com/junjie18/CMT.

Given the increasingly intricate forms of partial differential equations (PDEs) in physics and related fields, computationally solving PDEs without analytic solutions inevitably suffers from the trade-off between accuracy and efficiency. Recent advances in neural operators, a kind of mesh-independent neural-network-based PDE solvers, have suggested the dawn of overcoming this challenge. In this emerging direction, Koopman neural operator (KNO) is a representative demonstration and outperforms other state-of-the-art alternatives in terms of accuracy and efficiency. Here we present KoopmanLab, a self-contained and user-friendly PyTorch module of the Koopman neural operator family for solving partial differential equations. Beyond the original version of KNO, we develop multiple new variants of KNO based on different neural network architectures to improve the general applicability of our module. These variants are validated by mesh-independent and long-term prediction experiments implemented on representative PDEs (e.g., the Navier-Stokes equation and the Bateman-Burgers equation) and ERA5 (i.e., one of the largest high-resolution data sets of global-scale climate fields). These demonstrations suggest the potential of KoopmanLab to be considered in diverse applications of partial differential equations.

Rankings are widely collected in various real-life scenarios, leading to the leakage of personal information such as users' preferences on videos or news. To protect rankings, existing works mainly develop privacy protection on a single ranking within a set of ranking or pairwise comparisons of a ranking under the $\epsilon$-differential privacy. This paper proposes a novel notion called $\epsilon$-ranking differential privacy for protecting ranks. We establish the connection between the Mallows model (Mallows, 1957) and the proposed $\epsilon$-ranking differential privacy. This allows us to develop a multistage ranking algorithm to generate synthetic rankings while satisfying the developed $\epsilon$-ranking differential privacy. Theoretical results regarding the utility of synthetic rankings in the downstream tasks, including the inference attack and the personalized ranking tasks, are established. For the inference attack, we quantify how $\epsilon$ affects the estimation of the true ranking based on synthetic rankings. For the personalized ranking task, we consider varying privacy preferences among users and quantify how their privacy preferences affect the consistency in estimating the optimal ranking function. Extensive numerical experiments are carried out to verify the theoretical results and demonstrate the effectiveness of the proposed synthetic ranking algorithm.

Due to their ability to offer more comprehensive information than data from a single view, multi-view (multi-source, multi-modal, multi-perspective, etc.) data are being used more frequently in remote sensing tasks. However, as the number of views grows, the issue of data quality becomes more apparent, limiting the potential benefits of multi-view data. Although recent deep neural network (DNN) based models can learn the weight of data adaptively, a lack of research on explicitly quantifying the data quality of each view when fusing them renders these models inexplicable, performing unsatisfactorily and inflexible in downstream remote sensing tasks. To fill this gap, in this paper, evidential deep learning is introduced to the task of aerial-ground dual-view remote sensing scene classification to model the credibility of each view. Specifically, the theory of evidence is used to calculate an uncertainty value which describes the decision-making risk of each view. Based on this uncertainty, a novel decision-level fusion strategy is proposed to ensure that the view with lower risk obtains more weight, making the classification more credible. On two well-known, publicly available datasets of aerial-ground dual-view remote sensing images, the proposed approach achieves state-of-the-art results, demonstrating its effectiveness. The code and datasets of this article are available at the following address: https://github.com/gaopiaoliang/Evidential.

A noisy training set usually leads to the degradation of the generalization and robustness of neural networks. In this paper, we propose a novel theoretically guaranteed clean sample selection framework for learning with noisy labels. Specifically, we first present a Scalable Penalized Regression (SPR) method, to model the linear relation between network features and one-hot labels. In SPR, the clean data are identified by the zero mean-shift parameters solved in the regression model. We theoretically show that SPR can recover clean data under some conditions. Under general scenarios, the conditions may be no longer satisfied; and some noisy data are falsely selected as clean data. To solve this problem, we propose a data-adaptive method for Scalable Penalized Regression with Knockoff filters (Knockoffs-SPR), which is provable to control the False-Selection-Rate (FSR) in the selected clean data. To improve the efficiency, we further present a split algorithm that divides the whole training set into small pieces that can be solved in parallel to make the framework scalable to large datasets. While Knockoffs-SPR can be regarded as a sample selection module for a standard supervised training pipeline, we further combine it with a semi-supervised algorithm to exploit the support of noisy data as unlabeled data. Experimental results on several benchmark datasets and real-world noisy datasets show the effectiveness of our framework and validate the theoretical results of Knockoffs-SPR. Our code and pre-trained models will be released.

Temporal sentence grounding (TSG) aims to identify the temporal boundary of a specific segment from an untrimmed video by a sentence query. All existing works first utilize a sparse sampling strategy to extract a fixed number of video frames and then conduct multi-modal interactions with query sentence for reasoning. However, we argue that these methods have overlooked two indispensable issues: 1) Boundary-bias: The annotated target segment generally refers to two specific frames as corresponding start and end timestamps. The video downsampling process may lose these two frames and take the adjacent irrelevant frames as new boundaries. 2) Reasoning-bias: Such incorrect new boundary frames also lead to the reasoning bias during frame-query interaction, reducing the generalization ability of model. To alleviate above limitations, in this paper, we propose a novel Siamese Sampling and Reasoning Network (SSRN) for TSG, which introduces a siamese sampling mechanism to generate additional contextual frames to enrich and refine the new boundaries. Specifically, a reasoning strategy is developed to learn the inter-relationship among these frames and generate soft labels on boundaries for more accurate frame-query reasoning. Such mechanism is also able to supplement the absent consecutive visual semantics to the sampled sparse frames for fine-grained activity understanding. Extensive experiments demonstrate the effectiveness of SSRN on three challenging datasets.